Improvement in RSA Cryptosystem
نویسندگان
چکیده
Boneh and Shacham gave a nice survey on four variants (Batch RSA, MultiPrime RSA, MultiPower RSA, Rebalanced RSA). Rebalanced RSA and MultiPower RSA were then combined to increase the decryption/signature generation performance. This combination theoretically improves the decryption/signature generation time about 14 times than RSA with CRT and about 56 times than the standard RSA with key size 2048bits. On the encryption side, it increased the encryption time, thus making encryption/signature verification very costly. Here in this paper we further tried to increase the encryption/signature verification performance. The proposed scheme is semantically
منابع مشابه
Enhancement over the Variant of Public Key Cryptography (PKC) Algorithm
In this paper, we have shown the development of a new public key cryptosystem which is the extension of the work of “Improvement over three prime RSA with two private keys and one public key”. In many cases, the decryption generation speed is required to be enhanced,e.g; in banking sector, signature generation in one day can be in a large volume as compared to only single signature verification...
متن کاملStudy on the Scheme for RSA Iterative Encryption System
Based on the RSA public key cryptosystem, in this article, we put forward one sort of iterative encryption scheme based on RSA. The multiple keys can make attackers’ attacks to the system more difficult and further enhance the security of the key. Through the simulation of software, we realize the encryption transmission of binary image and validate the improvement of the RSA iterative encrypti...
متن کاملMeasuring Performance Overhead of Trans-encrypting HTTP Adaptive Streaming
The content distributors take content protection and Digital Rights Management of content very serious. As such many provisions already exist to make sure content is securely sent to, and only to, licensed clients. In this paper an alternative content encryption system is proposed by using the homomorphic features of asymmetric cryptography systems. Using a split-key derivative of the RSA crypt...
متن کاملCryptanalysis of RSA with Private Key d Less than N0.292
We show that if the private exponent d used in the RSA public-key cryptosystem is less than N then the system is insecure. This is the first improvement over an old result of Wiener showing that when d < N the RSA system is insecure. We hope our approach can be used to eventually improve the bound to d < N.
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کامل